Minimum Steiner Tree Construction
نویسندگان
چکیده
In optimizing the area of Very Large Scale Integrated (VLSI) layouts, circuit interconnections should generally be realized with minimum total interconnect. This chapter addresses several variations of the corresponding fundamental Steiner minimal tree (SMT) problem, where a given set of pins is to be connected using minimum total wirelength. Steiner trees are important in global routing and wirelength estimation [15], as well as in various non-VLSI applications such as phylogenetic tree reconstruction in biology [48], network routing [61], and civil engineering, among many other areas [21, 25, 26, 29, 51, 74].
منابع مشابه
A Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem
Self-stabilization is a theoretical framework of nonmasking fault-tolerant distributed algorithms. In this paper, we investigate the Steiner tree problem in distributed systems, and propose a selfstabilizing heuristic solution to the problem. Our algorithm is constructed by four layered modules (sub-algorithms): construction of a shortest path forest, transformation of the network, construction...
متن کاملAn Enhanced Heuristic Using Direct Steiner Point Locating and Distance Preferring MST Building Strategy for GOSST Problem
An enhanced heuristic for the GOSST (Grade of Services Steiner Minimum Tree) problem is proposed in this paper. GOSST problem is to look for a network topology satisfying the G-condition with minimum construction cost of the network. In previous research, we proposed a heuristic for the problem, which employed two Steiner point locating strategies with Naïve MST (Minimum Spanning Tree) building...
متن کاملISPD: FOARS: FLUTE Based Obstacle-Avoiding Rectilinear Steiner Tree Construction
In this paper, we present an algorithm called FOARS for obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction. FOARS applies a top-down approach which first partitions the set of pins into several subsets uncluttered by obstacles. Then an obstacle-avoiding Steiner tree is generated for each subset by an obstacle aware version of the rectilinear Steiner minimal tree (RSMT) alg...
متن کاملObstacle-Avoiding Rectilinear Minimum-Delay Steiner Tree Construction towards IP-Block-Based SOC Design
With System-on-Chip design, IP blocks form routing obstacles that deteriorate global interconnect delay. In this paper, we present a new approach for obstacle-avoiding rectilinear minimal delay Steiner tree (OARMDST) construction. We formalize the solving of minimum delay tree through the concept of an extended minimization function, and trade the objective into a top-down recursion, which wise...
متن کاملAlgorithms for the power-p Steiner tree problem in the Euclidean plane
We study the problem of constructing minimum power-p Euclidean k-Steiner trees in the plane. The problem is to find a tree of minimum cost spanning a set of given terminals where, as opposed to the minimum spanning tree problem, at most k additional nodes (Steiner points) may be introduced anywhere in the plane. The cost of an edge is its length to the power of p (where p ≥ 1), and the cost of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008